A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands
نویسندگان
چکیده
منابع مشابه
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
Given a vertex-weighted directed graph G = (V,E) and a set T = {t1, t2, . . . tk} of k terminals, the objective of the STRONGLY CONNECTED STEINER SUBGRAPH (SCSS) problem is to find a vertex set H ⊆V of minimum weight such that G[H] contains a ti→ t j path for each i 6= j. The problem is NP-hard, but Feldman and Ruhl (FOCS ’99; SICOMP ’06) gave a novel nO(k) algorithm for the SCSS problem, where...
متن کاملStrongly Connected Spanning Subgraph for Almost Symmetric Networks
In the strongly connected spanning subgraph (SCSS) problem, the goal is to find a minimum weight spanning subgraph of a strongly connected directed graph that maintains the strong connectivity. In this paper, we consider the SCSS problem for two families of geometric directed graphs; t-spanners and symmetric disk graphs. Given a constant t ≥ 1, a directed graph G is a t-spanner of a set of poin...
متن کاملApproximating the Minimum Strongly Connected Subgraph via a
Lower Bound. Adrian Vetta Abstract We present a 32 -approximation algorithm for the problem of nding a minimum strongly connected spanning subgraph in a given directed graph. As a corollary we obtain a 3 2 -approximation algorithm for the more general minimum equivalent digraph problem. The performance of our algorithm is measured against a lower bound obtained from a simple matching problem. T...
متن کاملStrongly connected components-Algorithm for finding the strongly connected components of a graph
A directed graph G (V, E) is strongly connected if and only if, for any pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to...
متن کاملA 32-Approximation Algorithm for the Multi-two-edge Connected Subgraph Problem
We present a 3 2 -approximation algorithm for the two-edge connected problem on a complete graph with non-negative costs, and multi-edges allowed in the solution. Previously, 2 was the best known performance guarantee.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0145-8